An overview of Rewrite Rule Laboratory (RRL)
نویسندگان
چکیده
منابع مشابه
An Overview of Rewrite Rule Laboratory (RRL)
RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into a full-edged theorem prover which has been used to solve hard and challenging mathematical problems in automated reasoning literature as well as a research tool for investigating the use of formal...
متن کاملA Newly Developed Laboratory Slab Roller Compactor (Turamesin): An Overview
Methods of preparing test specimens in laboratories are particularly important. It also holds true in terms of compaction procedure in predicting pavement performance. The currently available laboratory compactor cannot adequately replicate field compaction conditions, especially the Stone Mastic Asphalt (SMA) mixture. The essential element of SMA mixture comprises of stones that are placed nex...
متن کاملAn explicit Eta rewrite rule Daniel BRIAUD N ̊ 2417
In this report, we extend-calculi of explicit substitutions by an Eta rule. We do this in the framework of , a-calculus of explicit substitutions introduced by Lescanne (1994) and thoroughly studied by Lescanne and Rouyer-Degli (1994). The main feature of such a calculus is that the classical-contraction is expressed by a rst-order term rewriting system. Our main result is the explicitation of ...
متن کاملOn Termination of One Rule Rewrite Systems
The undecidability of the termination of rewrite systems is usually proved by reduction to the halting of Turing machines. In particular, Dauchet proves the unde-cidability of the termination of one rule rewrite systems by coding Turing machines into one rule rewrite systems. Rewrite systems are a very simple model of computation and one may expect proofs in this model to be more straightforwar...
متن کاملRewrite Rule Systems for Modal Propositional Logic
D This paper explains new results relating modal propositional logic and rewrite rule systems. More precisely, we give complete term rewriting systems for the modal propositional systems known as K, Q, T, and S5. These systems are presented as extensions of Hsiang’s system for classical propositional calculus. We have checked local confluence with the rewrite rule system K.B. (cf. the Knuth-Ben...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1995
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)00218-a